package dp;

/**
 * @author tmh
 * @date 2024/9/14 22:30
 * @description
 */
public class T62不同路径 {
    //定义一个二维的dp数组
    //dp[i][j]:表示从（0,0）到（i，j）有多少总走法
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        //初始化第一行
        for (int i = 0; i < n; i++) {
            dp[0][i] = 1;
        }
        //初始化第一列
        for (int j = 0; j < m; j++) {
            dp[j][0] = 1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[m-1][n-1];
    }
}
